GATE CSE 2010
Q31.
The following functional dependencies hold for relations R(A, B, C) and S(B, D, E) B \rightarrowA, A \rightarrowC The relation R contains 200tuples and the relation S contains 100tuples. What is the maximum number of tuples possible in the natural join R\Join S?Q32.
Let L = {w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expressions below represents L?Q35.
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W_{ij} in the matrix W below is the weight of the edge {i, j}. \begin{pmatrix} 0&1 & 8 & 1 &4 \\ 1& 0 & 12 & 4 & 9\\ 8 & 12 & 0 & 7 & 3\\ 1& 4& 7 & 0 &2 \\ 4& 9 & 3& 2 &0 \end{pmatrix}What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?Q36.
A relational schema for a train reservation database is given below What pids are returned by the following SQL query for the above instance of the tables? SELECT pid FROM Re servation WHERE class 'AC' AND EXISTS (SELECT * FROM Passenger WHERE age > 65 AND Passenger.pid Reservation.pid)Q37.
Consider the following schedule for transactions T1, T2 and T3: Which one of the schedules below is the correct serialization of the above?Q38.
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I. 2-phase locking II. Time-stamp orderingQ39.
In the sequential circuit shown below, if the initial value of the output Q_{1}Q_{0} is 00, what are the next four values of Q_{1}Q_{0} ?